Excedance Numbers for Permutations in Complex Reflection Groups

نویسندگان

  • Toufik Mansour
  • Yidong Sun
چکیده

The classical Weyl groups appear as special cases: for r = s = 1 we have the symmetric group G1,1,n = Sn, for r = 2s = 2 we have the hyperoctahedral group G2,1,n = Bn, and for r = s = 2 we have the group of even-signed permutations G2,2,n = Dn. We say that a permutation π ∈ Gr,s,n is an involution if π 2 = 1. More generally, we define G r,s,n = {σ ∈ Gr,s,n|σ m = 1}. Recently, Bagno, Garber and Mansour [2] studied an excedance number on the complex reflection groups (see [4]) and computed the number of involutions having specific numbers of fixed points and excedances. In this note, we consider the similar problems on the set G r,s,n. This paper is organized as follows. In Section 2, we recall some properties of Gr,s,n and define some parameters on Gr,n = Gr,1,n and hence also on Gr,s,n. In Section 3 we present our main results and compute the corresponding recurrences together with explicit formulas.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Recursions for Excedance Number in Some Permutations Groups

The excedance number for Sn is known to have an Eulerian distribution. Nevertheless, the classical proof uses descents rather than excedances. We present a direct recursive proof which seems to be folklore and extend it to the colored permutation groups Gr,n. The generalized recursion yields some interesting connection to Stirling numbers of the second kind. We also show some logconcavity resul...

متن کامل

Excedance Number for Involutions in Complex Reflection Groups

We define the excedance number on the complex reflection groups and compute its multidistribution with the number of fixed points on the set of involutions in these groups. We use some recurrences and generating functions manipulations to obtain our results.

متن کامل

Efficient generating algorithm for permutations with a fixed number of excedances

In this paper, we develop a constant amortized time (CAT) algorithm for generating permutations with a fixed number of excedances. We obtain a Gray code for permutations having one excedance. We also give a bijection between the set of n-length permutations with exactly one excedance and the set Sn(321, 2413, 3412, 21534)\{123 . . . (n− 1)n}. This induces a Gray code for the set Sn(321, 2413, 3...

متن کامل

Excedance Numbers for the Permutations of Type B

This work provides a study on the multidistribution of type B excedances, fixed points and cycles on the permutations of type B. We derive the recurrences and closed formulas for the distribution of signed excedances on type B permutations as well as derangements via combinatorial construction. Based on this result, we obtain the recurrence and generating function for the signed excedance polyn...

متن کامل

Excedances and Descents of Bi-increasing Permutations

Motivated by the relations between certain difference statistics and the classical permutation statistics we study permutations whose inversion number and excedance difference coincide. It turns out that these (socalled bi-increasing) permutations are just the 321-avoiding ones. The paper investigates their excedance and descent structure. In particular, we give some combinatorial interpretatio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008